Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
نویسندگان
چکیده
منابع مشابه
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
An efficient method to generate all edge sets X ⊆ E of a graph G = (V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality 5, (iii) all chordless cycles, (iv) all Hamiltonian cycles. © 2007 Elsevier B.V. All rights reserved.
متن کاملEfficient Enumeration of Chordless Cycles
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To g...
متن کاملHamiltonian cycles with all small even chords
Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycle C = v1v2 . . . vnv1 of G with chords vivi+3 for all 1 ≤ i ≤ n (where vn+j = vj for j ≥ 1). When n is even, an ESHC contains all bipartite 2-regular graphs of order n. We prove that there is a positive integer N such that for every graph G of even order n ≥ N , if the minimum degree δ(G) ≥ n 2 +...
متن کاملGenerating Hamiltonian Cycles in Complete Graphs
We prove that hamiltonian cycles of complete graphs can be generated in a Gray code manner by means of small local interchanges.
متن کاملIdentification of Chordless Cycles in Ecological Networks
In the last few years the studies on complex networks have gained extensive research interests. Significant impacts are made by these studies on a wide range of different areas including social networks, technology networks, biological networks and others. Motivated by understanding the structure of ecological networks we introduce in this paper a new algorithm for enumerating all chordless cyc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2007.01.005